An Efficient Shortest-Path Aided Back-Pressure Routing over Multihop Wireless Network

This project proposes a new optimal routing/scheduling back-pressure algorithm that not only guarantees network stability (throughput optimality), but also adaptively selects a set of optimal routes based on shortest-path information in order to minimize average path lengths between each source and destination pair. Our results indicate that under the traditional back-pressure algorithm, the end-toend packet delay first decreases and then increases as a function of the network load (arrival rate). The proposed particle swarm optimization based back pressure algorithm adaptively selects a set of routes according to the traffic load and energy efficiency so that long paths are used only when necessary, thus resulting in much smaller end-to-end packet delays as compared to the traditional back-pressure